SherbyNet - /page/wikibook/entry.mu

Micron Document

<!DOCTYPE html>

<title>Schema matching</title>

</head>

Schema matching

</h1>

</header>

/* start https://en.wikipedia.org/ */

.mw-parser-output .ambox{border:1px solid #a2a9b1;border-left:10px solid #36c;background-color:#fbfbfb;box-sizing:border-box}.mw-parser-output .ambox+link+.ambox,.mw-parser-output .ambox+link+style+.ambox,.mw-parser-output .ambox+link+link+.ambox,.mw-parser-output .ambox+.mw-empty-elt+link+.ambox,.mw-parser-output .ambox+.mw-empty-elt+link+style+.ambox,.mw-parser-output .ambox+.mw-empty-elt+link+link+.ambox{margin-top:-1px}html body.mediawiki .mw-parser-output .ambox.mbox-small-left{margin:4px 1em 4px 0;overflow:hidden;width:238px;border-collapse:collapse;font-size:88%;line-height:1.25em}.mw-parser-output .ambox-speedy{border-left:10px solid #b32424;background-color:#fee7e6}.mw-parser-output .ambox-delete{border-left:10px solid #b32424}.mw-parser-output .ambox-content{border-left:10px solid #f28500}.mw-parser-output .ambox-style{border-left:10px solid #fc3}.mw-parser-output .ambox-move{border-left:10px solid #9932cc}.mw-parser-output .ambox-protection{border-left:10px solid #a2a9b1}.mw-parser-output .ambox .mbox-text{border:none;padding:0.25em 0.5em;width:100%}.mw-parser-output .ambox .mbox-image{border:none;padding:2px 0 2px 0.5em;text-align:center}.mw-parser-output .ambox .mbox-imageright{border:none;padding:2px 0.5em 2px 0;text-align:center}.mw-parser-output .ambox .mbox-empty-cell{border:none;padding:0;width:1px}.mw-parser-output .ambox .mbox-image-div{width:52px}@media(min-width:720px){.mw-parser-output .ambox{margin:0 10%}}@media print{body.ns-0 .mw-parser-output .ambox{display:none!important}}

/* end https://en.wikipedia.org/ */

</style>

The terms schema matching and <a href="Data_mapping" title="Data mapping">mapping</a> are often used interchangeably for a <a href="Database" title="Database">database</a> process. For this article, we differentiate the two as follows: <a href="Database_schema" title="Database schema">schema</a> matching is the process of identifying that two objects are <a href="Semantic" class="mw-redirect" title="Semantic">semantically</a> related (scope of this article) while mapping refers to the <a href="Data_transformation" class="mw-redirect" title="Data transformation">transformations</a> between the objects. For example, in the two schemas DB1.Student (Name, SSN, Level, Major, Marks)

and DB2.Grad-Student (Name, ID, Major, Grades); possible matches would be: DB1.Student ≈ DB2.Grad-Student; DB1.SSN = DB2.ID etc. and possible transformations or mappings would be: DB1.Marks to DB2.Grades (100–90 A; 90–80 B: etc.).

Automating these two approaches has been one of the fundamental tasks of <a href="Data_integration" title="Data integration">data integration</a>. In general, it is not possible to determine fully automatically the different correspondences between two schemas — primarily because of the differing and often not explicated or documented semantics of the two schemas.

<div class="mw-heading mw-heading2"><h2 id="Impediments">Impediments</h2></div>

Among others, common challenges to automating matching and mapping have been previously classified in<a href="#cite_note-kim-1">[1]</a> especially for relational DB schemas; and in<a href="#cite_note-sk-2">[2]</a> – a fairly comprehensive list of heterogeneity not limited to the relational model recognizing schematic vs semantic differences/heterogeneity. Most of these heterogeneities exist because schemas use different representations or definitions to represent the same information (schema conflicts); OR different expressions, units, and precision result in conflicting representations of the same data (data conflicts).<a href="#cite_note-kim-1">[1]</a>

Research in schema matching seeks to provide automated support to the process of finding semantic matches between two schemas. This process is made harder due to heterogeneities at the following levels<a href="#cite_note-sheth99-3">[3]</a>

<ul><li>Syntactic heterogeneity – differences in the language used for representing the elements</li>

<li>Structural heterogeneity – differences in the types, structures of the elements</li>

<li>Model / Representational heterogeneity – differences in the underlying models (database, ontologies) or their representations (key-value pairs, relational, document, XML, JSON, triples, graph, RDF, OWL)</li>

<li><a href="Semantic_heterogeneity" title="Semantic heterogeneity">Semantic heterogeneity</a> – where the same real world entity is represented <a href="Synonym" title="Synonym">using different terms</a> or <a href="Homonym" title="Homonym">vice versa</a></li></ul>

<div class="mw-heading mw-heading2"><h2 id="Schema_matching">Schema matching</h2></div>

<div class="mw-heading mw-heading3"><h3 id="Methodology">Methodology</h3></div>

Discusses a generic methodology for the task of schema integration or the activities involved.<a href="#cite_note-batini-5">[5]</a> According to the authors, one can view the integration.

<ul><li>Preintegration — An analysis of schemas is carried out before integration to decide upon some integration policy. This governs the choice of schemas to be integrated, the order of integration, and a possible assignment of preferences to entire schemas or portions of schemas.</li>

<li>Comparison of the Schemas — Schemas are analyzed and compared to determine the correspondences among concepts and detect possible conflicts. Interschema properties may be discovered while comparing schemas.</li>

<li>Conforming the Schemas — Once conflicts are detected, an effort is made to resolve them so that the merging of various schemas is possible.</li>

<li>Merging and Restructuring — Now the schemas are ready to be superimposed, giving rise to some intermediate integrated schema(s). The intermediate results are analyzed and, if necessary, restructured in order to achieve several desirable qualities.</li></ul>

<div class="mw-heading mw-heading3"><h3 id="Approaches">Approaches</h3></div>

Approaches to schema integration can be broadly classified as ones that exploit either just schema information or schema and instance level information.<a href="#cite_note-rahm-4">[4]</a><a href="#cite_note-batini-5">[5]</a>

Schema-level matchers only consider schema information, not instance data. The available information includes the usual properties of schema elements, such as name, description, data type, relationship types (part-of, is-a, etc.), constraints, and schema structure. Working at the element (atomic elements like attributes of objects) or structure level (matching combinations of elements that appear together in a structure), these properties are used to identify matching elements in two schemas. Language-based or linguistic matchers use names and text (i.e., words or sentences) to find semantically similar schema elements. Constraint based matchers exploit constraints often contained in schemas. Such constraints are used to define data types and value ranges, uniqueness, optionality, relationship types and cardinalities, etc. Constraints in two input schemas are matched to determine the similarity of the schema elements.

Instance-level matchers use instance-level data to gather important insight into the contents and meaning of the schema elements. These are typically used in addition to schema level matches in order to boost the confidence in match results, more so when the information available at the schema level is insufficient. Matchers at this level use linguistic and constraint based characterization of instances. For example, using linguistic techniques, it might be possible to look at the Dept, DeptName and EmpName instances to conclude that DeptName is a better match candidate for Dept than EmpName. Constraints like zipcodes must be 5 digits long or format of phone numbers may allow matching of such types of instance data.<a href="#cite_note-9">[9]</a>

Hybrid matchers directly combine several matching approaches to determine match candidates based on multiple criteria or information sources.

Most of these techniques also employ additional information such as dictionaries, thesauri, and user-provided match or mismatch information<a href="#cite_note-10">[10]</a>

Reusing matching information

Another initiative has been to re-use previous matching information as auxiliary information for future matching tasks. The motivation for this work is that structures or substructures often repeat, for example in schemas in the E-commerce domain. Such a reuse of previous matches however needs to be a careful choice. It is possible that such a reuse makes sense only for some part of a new schema or only in some domains. For example, Salary and Income may be considered identical in a payroll application but not in a tax reporting application. There are several open ended challenges in such reuse that deserves further work.

Sample Prototypes

Typically, the implementation of such matching techniques can be classified as being either rule based or learner based systems. The complementary nature of these different approaches has instigated a number of applications using a combination of techniques depending on the nature of the domain or application under consideration.<a href="#cite_note-rahm-4">[4]</a><a href="#cite_note-batini-5">[5]</a>

<div class="mw-heading mw-heading3"><h3 id="Identified_relationships">Identified relationships</h3></div>

The relationship types between objects that are identified at the end of a matching process are typically those with set semantics such as overlap, disjointness, exclusion, equivalence, or subsumption. The logical encodings of these relationships are what they mean. Among others, an early attempt to use description logics for schema integration and identifying such relationships was presented.<a href="#cite_note-relns-11">[11]</a> Several state of the art matching tools today<a href="#cite_note-rahm-4">[4]</a><a href="#cite_note-Kalfoglou-7">[7]</a> and those benchmarked in the Ontology Alignment Evaluation Initiative<a href="#cite_note-oaei-12">[12]</a> are capable of identifying many such simple (1:1 / 1:n / n:1 element level matches) and complex matches (n:1 / n:m element or structure level matches) between objects.

<div class="mw-heading mw-heading3"><h3 id="Evaluation_of_quality">Evaluation of quality</h3></div>

The quality of schema matching is commonly measured by <a href="Precision_and_recall" title="Precision and recall">precision and recall</a>. While precision measures the number of correctly matched pairs out of all pairs that

were matched, recall measures how many of the actual pairs have been matched.

<ul><li><a href="Data_integration" title="Data integration">Data integration</a></li>

<li><a href="Dataspaces" class="mw-redirect" title="Dataspaces">Dataspaces</a></li>

<li><a href="Federated_database_system" title="Federated database system">Federated database system</a></li>

<li><a href="Minimal_mappings" title="Minimal mappings">Minimal mappings</a></li>

<li><a href="Ontology_alignment" title="Ontology alignment">Ontology alignment</a></li>

<li><a href="Schema_crosswalk" title="Schema crosswalk">Schema crosswalk</a></li></ul>

<div class="mw-heading mw-heading2"><h2 id="References">References</h2></div>

/* start https://en.wikipedia.org/ */

.mw-parser-output .reflist{margin-bottom:0.5em;list-style-type:decimal}@media screen{.mw-parser-output .reflist{font-size:90%}}.mw-parser-output .reflist .references{font-size:100%;margin-bottom:0;list-style-type:inherit}.mw-parser-output .reflist-columns-2{column-width:30em}.mw-parser-output .reflist-columns-3{column-width:25em}.mw-parser-output .reflist-columns{margin-top:0.3em}.mw-parser-output .reflist-columns ol{margin-top:0}.mw-parser-output .reflist-columns li{page-break-inside:avoid;break-inside:avoid-column}.mw-parser-output .reflist-upper-alpha{list-style-type:upper-alpha}.mw-parser-output .reflist-upper-roman{list-style-type:upper-roman}.mw-parser-output .reflist-lower-alpha{list-style-type:lower-alpha}.mw-parser-output .reflist-lower-greek{list-style-type:lower-greek}.mw-parser-output .reflist-lower-roman{list-style-type:lower-roman}

/* end https://en.wikipedia.org/ */

</style><div class="reflist">

/* start https://en.wikipedia.org/ */

.mw-parser-output cite.citation{font-style:inherit;word-wrap:break-word}.mw-parser-output .citation q{quotes:"\"""\"""'""'"}.mw-parser-output .citation:target{background-color:rgba(0,127,255,0.133)}.mw-parser-output .id-lock-free.id-lock-free a{background:url("./mw/Lock-green.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-limited.id-lock-limited a,.mw-parser-output .id-lock-registration.id-lock-registration a{background:url("./mw/Lock-gray-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-subscription.id-lock-subscription a{background:url("./mw/Lock-red-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .cs1-ws-icon a{background:url("./mw/Wikisource-logo.svg")right 0.1em center/12px no-repeat}body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-free a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-limited a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-registration a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-subscription a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .cs1-ws-icon a{background-size:contain;padding:0 1em 0 0}.mw-parser-output .cs1-code{color:inherit;background:inherit;border:none;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;color:var(--color-error,#d33)}.mw-parser-output .cs1-visible-error{color:var(--color-error,#d33)}.mw-parser-output .cs1-maint{display:none;color:#085;margin-left:0.3em}.mw-parser-output .cs1-kern-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right{padding-right:0.2em}.mw-parser-output .citation .mw-selflink{font-weight:inherit}@media screen{.mw-parser-output .cs1-format{font-size:95%}html.skin-theme-clientpref-night .mw-parser-output .cs1-maint{color:#18911f}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .cs1-maint{color:#18911f}}

/* end https://en.wikipedia.org/ */

</style><cite id="CITEREFKim,_W.Seo,_J.1991" class="citation conference cs1">Kim, W. & Seo, J. (Dec 1991). "Classifying Schematic and Data Heterogeneity in Multidatabase Systems.". Computer 24, 12.</cite>

</li>

<li id="cite_note-sk-2"><a href="#cite_ref-sk_2-0">^</a> <cite id="CITEREFSheth,_A._P.Kashyap,_V.1993" class="citation conference cs1">Sheth, A. P. & Kashyap, V. (1993). "So Far (Schematically) yet So Near (Semantically)". In Proceedings of the IFIP WG 2.6 Database Semantics Conference on interoperable Database Systems.</cite>

</li>

<li id="cite_note-sheth99-3"><a href="#cite_ref-sheth99_3-0">^</a> <cite id="CITEREFSheth,_A._P.1999" class="citation conference cs1">Sheth, A. P. (1999). "Changing Focus on Interoperability in Information Systems: From System, Syntax, Structure to Semantics". In Interoperating Geographic Information Systems. M. F. Goodchild, M. J. Egenhofer, R. Fegeas, and C. A. Kottman (eds.), Kluwer, Academic Publishers.</cite>

</li>

<li id="cite_note-rahm-4">^ <a href="#cite_ref-rahm_4-0">a</a> <a href="#cite_ref-rahm_4-1">b</a> <a href="#cite_ref-rahm_4-2">c</a> <a href="#cite_ref-rahm_4-3">d</a> <cite id="CITEREFRahm,_E.Bernstein,_P2001" class="citation conference cs1">Rahm, E. & Bernstein, P (2001). "A survey of approaches to automatic schema matching". The VLDB Journal 10, 4.</cite>

</li>

<li id="cite_note-batini-5">^ <a href="#cite_ref-batini_5-0">a</a> <a href="#cite_ref-batini_5-1">b</a> <a href="#cite_ref-batini_5-2">c</a> <a href="#cite_ref-batini_5-3">d</a> <cite id="CITEREFBatini,_C.,_Lenzerini,_M.,_and_Navathe,_S._B.1986" class="citation conference cs1">Batini, C., Lenzerini, M., and Navathe, S. B. (1986). "A comparative analysis of methodologies for database schema integration.". ACM Comput. Surv. 18, 4.</cite><code class="cs1-code">{{cite conference}}</code>: CS1 maint: multiple names: authors list (link)

</li>

<li id="cite_note-doan-6"><a href="#cite_ref-doan_6-0">^</a> <cite id="CITEREFDoan,_A.Halevy,_A.2005" class="citation conference cs1">Doan, A. & Halevy, A. (2005). "Semantic-integration research in the database community". AI Mag. 26, 1.</cite>

</li>

<li id="cite_note-Kalfoglou-7">^ <a href="#cite_ref-Kalfoglou_7-0">a</a> <a href="#cite_ref-Kalfoglou_7-1">b</a> <cite id="CITEREFKalfoglou,_Y.Schorlemmer,_M.2003" class="citation conference cs1">Kalfoglou, Y. & Schorlemmer, M. (2003). "Ontology mapping: the state of the art". Knowl. Eng. Rev. 18, 1.</cite>

</li>

<li id="cite_note-choi-8"><a href="#cite_ref-choi_8-0">^</a> <cite id="CITEREFChoi,_N.,_Song,_I.,_and_Han,_H.2006" class="citation conference cs1">Choi, N., Song, I., and Han, H. (2006). "A survey on ontology mapping". SIGMOD Rec. 35, 3.</cite><code class="cs1-code">{{cite conference}}</code>: CS1 maint: multiple names: authors list (link)

</li>

<li id="cite_note-9"><a href="#cite_ref-9">^</a> <cite id="CITEREFPereira_NunesMeraCasanovaP._Paes_Leme2013" class="citation book cs1">Pereira Nunes, Bernardo; Mera, Alexander; Casanova, Marco Antonio; P. Paes Leme, Luis Andre; Dietze, Stefan (2013). <a rel="nofollow" class="external text" href="http://www.repo.uni-hannover.de/handle/123456789/1358">"Complex Matching of RDF Datatype Properties"</a>. Database and Expert Systems Applications. Lecture Notes in Computer Science. Vol. 8055. pp. 195–208. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1007%2F978-3-642-40285-2_18">10.1007/978-3-642-40285-2_18</a>. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-3-642-40284-5</bdi>.</cite>

</li>

<li id="cite_note-10"><a href="#cite_ref-10">^</a> <cite id="CITEREFHamdaqaTahvildari2014" class="citation book cs1">Hamdaqa, Mohammad; Tahvildari, Ladan (2014). "Prison Break: A Generic Schema Matching Solution to the Cloud Vendor Lock-in Problem". 2014 IEEE 8th International Symposium on the Maintenance and Evolution of Service-Oriented and Cloud-Based Systems. pp. 37–46. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2FMESOCA.2014.13">10.1109/MESOCA.2014.13</a>. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-1-4799-6152-8</bdi>. <a href="S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:14499875">14499875</a>.</cite>

</li>

<li id="cite_note-relns-11"><a href="#cite_ref-relns_11-0">^</a> <cite id="CITEREFAshoka_SavasereAmit_P._ShethSunit_K._GalaShamkant_B._Navathe1993" class="citation conference cs1">Ashoka Savasere; Amit P. Sheth; Sunit K. Gala; Shamkant B. Navathe; H. Markus (1993). "On Applying Classification to Schema Integration". RIDE-IMS.</cite>

</li>

<li id="cite_note-oaei-12"><a href="#cite_ref-oaei_12-0">^</a> <a rel="nofollow" class="external text" href="http://oaei.ontologymatching.org/2006/">Ontology Alignment Evaluation Initiative::2006</a>

</li>

</ol></div></div>

<div class="mw-heading mw-heading2"><h2 id="External_links">External links</h2></div>

<ul><li><a rel="nofollow" class="external text" href="http://knoesis.wright.edu/library/download/S04-Dagstuhl-Early-Work.pdf">Early work in schema matching</a></li></ul></div><div><div class="zim-footer">

This article is issued from <a class="external text" title="Last edited on 2024-08-27" href="https://en.wikipedia.org/wiki/?title=Schema_matching&oldid=1242634240">Wikipedia</a>. The text is available under <a class="external text" href="https://creativecommons.org/licenses/by-sa/4.0/deed.en">Creative Commons Attribution-Share Alike 4.0</a> unless otherwise noted. Additional terms may apply for the media files.

</div>

</div></div>

</div>

</main>

</div>

</body></html>